Search results for "Conjugate gradient method"
showing 10 items of 23 documents
On a global superconvergence of the gradient of linear triangular elements
1987
Abstract We study a simple superconvergent scheme which recovers the gradient when solving a second-order elliptic problem in the plane by the usual linear elements. The recovered gradient globally approximates the true gradient even by one order of accuracy higher in the L 2 -norm than the piecewise constant gradient of the Ritz—Galerkin solution. A superconvergent approximation to the boundary flux is presented as well.
Time-harmonic solution for acousto-elastic interaction with controllability and spectral elements
2010
The classical way of solving the time-harmonic linear acousto-elastic wave problem is to discretize the equations with finite elements or finite differences. This approach leads to large-scale indefinite complex-valued linear systems. For these kinds of systems, it is difficult to construct efficient iterative solution methods. That is why we use an alternative approach and solve the time-harmonic problem by controlling the solution of the corresponding time dependent wave equation. In this paper, we use an unsymmetric formulation, where fluid-structure interaction is modeled as a coupling between pressure and displacement. The coupled problem is discretized in space domain with spectral el…
Quasi-Newton approach to nonnegative image restorations
2000
Abstract Image restoration, or deblurring, is the process of attempting to correct for degradation in a recorded image. Typically the blurring system is assumed to be linear and spatially invariant, and fast Fourier transform (FFT) based schemes result in efficient computational image restoration methods. However, real images have properties that cannot always be handled by linear methods. In particular, an image consists of positive light intensities, and thus a nonnegativity constraint should be enforced. This constraint and other ways of incorporating a priori information have been suggested in various applications, and can lead to substantial improvements in the reconstructions. Neverth…
A second-order sparse factorization method for Poisson's equation with mixed boundary conditions
1992
Abstract We propose an algorithm for solving Poisson's equation on general two-dimensional regions with an arbitrary distribution of Dirichlet and Neumann boundary conditions. The algebraic system, generated by the five-point star discretization of the Laplacian, is solved iteratively by repeated direct sparse inversion of an approximating system whose coefficient matrix — the preconditioner — is second-order both in the interior and on the boundary. The present algorithm for mixed boundary value problems generalizes a solver for pure Dirichlet problems (proposed earlier by one of the authors in this journal (1989)) which was found to converge very fast for problems with smooth solutions. T…
Conjugate Gradient Method for Brain Magnetic Resonance Images Segmentation
2018
Part 8: Pattern Recognition and Image Processing; International audience; Image segmentation is the process of partitioning the image into regions of interest in order to provide a meaningful representation of information. Nowadays, segmentation has become a necessity in many practical medical imaging methods as locating tumors and diseases. Hidden Markov Random Field model is one of several techniques used in image segmentation. It provides an elegant way to model the segmentation process. This modeling leads to the minimization of an objective function. Conjugate Gradient algorithm (CG) is one of the best known optimization techniques. This paper proposes the use of the nonlinear Conjugat…
A Nonlinear Primal-Dual Method for Total Variation-Based Image Restoration
1999
We present a new method for solving total variation (TV) minimization problems in image restoration. The main idea is to remove some of the singularity caused by the nondifferentiability of the quantity $|\nabla u|$ in the definition of the TV-norm before we apply a linearization technique such as Newton's method. This is accomplished by introducing an additional variable for the flux quantity appearing in the gradient of the objective function, which can be interpreted as the normal vector to the level sets of the image u. Our method can be viewed as a primal-dual method as proposed by Conn and Overton [ A Primal-Dual Interior Point Method for Minimizing a Sum of Euclidean Norms, preprint,…
Direct Numerical Methods for Optimal Control Problems
2003
Development of interior point methods for linear and quadratic programming problems occurred during the 1990’s. Because of their simplicity and their convergence properties, interior point methods are attractive solvers for such problems. Moreover, extensions have been made to more general convex programming problems.
Controllability method for the Helmholtz equation with higher-order discretizations
2007
We consider a controllability technique for the numerical solution of the Helmholtz equation. The original time-harmonic equation is represented as an exact controllability problem for the time-dependent wave equation. This problem is then formulated as a least-squares optimization problem, which is solved by the conjugate gradient method. Such an approach was first suggested and developed in the 1990s by French researchers and we introduce some improvements to its practical realization. We use higher-order spectral elements for spatial discretization, which leads to high accuracy and lumped mass matrices. Higher-order approximation reduces the pollution effect associated with finite elemen…
A Numerical Method for an Inverse Problem Arising in Two-Phase Fluid Flow Transport Through a Homogeneous Porous Medium
2019
In this paper we study the inverse problem arising in the model describing the transport of two-phase flow in porous media. We consider some physical assumptions so that the mathematical model (direct problem) is an initial boundary value problem for a parabolic degenerate equation. In the inverse problem we want to determine the coefficients (flux and diffusion functions) of the equation from a set of experimental data for the recovery response. We formulate the inverse problem as a minimization of a suitable cost function and we derive its numerical gradient by means of the sensitivity equation method. We start with the discrete formulation and, assuming that the direct problem is discret…
IBSIMU: a three-dimensional simulation software for charged particle optics.
2010
A general-purpose three-dimensional (3D) simulation code IBSIMU for charged particle optics with space charge is under development at JYFL. The code was originally developed for designing a slit-beam plasma extraction and nanosecond scale chopping for pulsed neutron generator, but has been developed further and has been used for many applications. The code features a nonlinear FDM Poisson's equation solver based on fast stabilized biconjugate gradient method with ILU0 preconditioner for solving electrostatic fields. A generally accepted nonlinear plasma model is used for plasma extraction. Magnetic fields can be imported to the simulations from other programs. The particle trajectories are …